Open shop scheduling problems with late work criteria
نویسندگان
چکیده
منابع مشابه
Open shop scheduling problems with late work criteria
The paper concerns the application of a non-classical performance measure, a late work criterion (Y, Yw), to scheduling problems. It estimates the quality of the obtained solution with regard to the duration of the late parts of tasks not taking into account the quantity of this delay. The paper provides the formal definition of the late work parameter, especially in the shop environment, toget...
متن کاملUnit-time Open-shop Scheduling Problems with Symmetric Objective Functions
The paper deals with the open-shop problems with unit-time operations and nonde-creasing symmetric objective functions depending on job completion times. We construct two schedules, one of them is optimal for any symmetric convex function, the other is optimal for any symmetric concave function. Each of these two schedules is given by an analytically deened function which assigns to each operat...
متن کاملGenetic Algorithms for Solving Open Shop Scheduling Problems
In this paper we investigate the use of three evolutionary based heuristics to the open shop scheduling problem. The intractability of this problem is a motivation for the pursuit of heuristics that produce approximate solutions. This work introduces three evolutionary based heuristics, namely, a permutation genetic algorithm, a hybrid genetic algorithm and a sellsh gene algorithm, and tests th...
متن کاملPartially-Concurrent Open Shop Scheduling
The partially-concurrent open shop scheduling problem is presented. The standard open shop scheduling problem is generalized by allowing some operations to be processed concurrently. This generalization is directly motivated from a real-life timetabling project of assigning technicians to airplanes in an airplane garage. A schedule for the partially-concurrent problem is represented by a digrap...
متن کاملFlexible Job-Shop Scheduling Problems
Planning and scheduling problems in various industrial environments are combinatorial and very difficult. Generally, it is extremely hard to solve these types of problems in their general form. Scheduling can be formulated as a problem of determining the best sequence to execute a set of tasks on a set of resources, respecting specific constraints like precedence or disjunctive constraints (Car...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2004
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(03)00339-1